A search game taking account of attributes of searching resources

This article deals with a two‐person zero‐sum game called a search allocation game (SAG), in which a searcher and a target participate as players. The searcher distributes his searching resources in a search space to detect the target. The effect of resources lasts a certain period of time and extends to some areas at a distance from the resources' dropped points. On the other hand, the target moves around in the search space to evade the searcher. In the history of search games, there has been little research covering the durability and reachability of searching resources. This article proposes two linear programming formulations to solve the SAG with durable and reachable resources, and at the same time provide an optimal strategy of distributing searching resources for the searcher and an optimal moving strategy for the target. Using examples, we will analyze the influences of two attributes of resources on optimal strategies. © 2007 Wiley Periodicals, Inc. Naval Research Logistics 2008     

An attacker‐defender model for analyzing the vulnerability of initial attack in wildfire suppression

Wildfire managers use initial attack (IA) to control wildfires before they grow large and become difficult to suppress. Although the majority of wildfire incidents are contained by IA, the small percentage of fires that escape IA causes most of the damage. Therefore, planning a successful IA is very important. In this article, we study the vulnerability of IA in wildfire suppression using an attacker‐defender Stackelberg model. The attacker's objective is to coordinate the simultaneous ignition of fires at various points in a landscape to maximize the number of fires that cannot be contained by IA. The defender's objective is to optimally dispatch suppression resources from multiple fire stations located across the landscape to minimize the number of wildfires not contained by IA. We use a decomposition algorithm to solve the model and apply the model on a test case landscape. We also investigate the impact of delay in the response, the fire growth rate, the amount of suppression resources, and the locations of fire stations on the success of IA.     

信息化条件下基于大数据的后装一体化保障构想

由于契约的不完全性、专用性资产的存在,导致民企参军的谈判过程中,一方可能利用另一方因专用性资产投资的锁定效应,而采取机会主义行为将另一方套牢,攫取可占用专用性准租金。这种套牢风险不是单向的,而是双向的,双向套牢风险的存在不仅会降低军品科研生产项目建设质量,而且还会严重挫伤民营企业承担军品科研生产任务的积极性。为有效防范双向套牢风险,本文将从博弈论的角度,建立民营企业与军队采办部门的期望收益与专用性资产投资的函数关系和博弈矩阵,分阶段讨论民营企业与军队采办部门所面临的套牢风险大小及各自的最佳行为选择。以降低民企参军面临的套牢风险,引导更多优势民营企业进入军品科研生产与维修领域,推动军民融合的深度发展。     

目的论在翻译理论中的地位

目的论是功能翻译理论的核心思想，它强调的是目的决定手段，它包括译者、文本、语言、文化等为一体的综合性研究。     

人本主义教育思想的德育解读与借鉴

人本主义教育思想在教育理念、教育目标、教育过程、教育方法、教育评价等方面均对德育具有借鉴意义。德育的目标指向：培育受教育者的完美人性;实施途径：强调受教育者的直接经验;德育模式：凸显受教育者的主体地位。     

基于灰色系统理论的火灾事故预测方法

简要叙述应用灰色系统理论进行火灾事故预测的理论和方法 ,建立了火灾事故预测的GM (1,1)模型 ,并用该模型对火灾事故进行预测。     

Lanchester方程与火力指数的内在联系

本文从Lanchester 方程出发,利用正矩阵的特性,将矩阵特征向量与火力指数有机地联系起来。通过例子进一步说明火力指数是Lanchester 方程中威力系数概念的推广;它不仅与武器本身有关,而且依赖于整个战斗的武器配系。当某些种类的武器被摧毁,战斗格局发生一定变化时,火力指数也会发生变化。火力指数还决定于火力分配原则。     

一个组合对策问题的解

本文求解如下的组合对策问题:设有一堆棋子,总数N 是奇数,甲乙两人轮流取子,每人每次可取一颗、二颗,最多可取s 颗,但不能不取,直至取完后分别来数甲乙两人所取棋子的总数,总数为奇数者获胜。站在甲的立场上考虑获胜的策略,文中解决了如下两个问题:(Ⅰ)总数N 应是什么样的奇数,甲才有获胜策略;(Ⅱ)当N 一定时,甲应采取什么样的策略取子,才能获胜。     

方差分量的Bayes二次无偏估计及可容许估计的非负性

对于有P 个方差分量的线性模型,本文导出了方差分量线性函数的Bayes 不变二次无偏估计的显示表达式,证明了Bayes 不变二次无偏估计类形成了可容许的不变二次无偏估计的完全类。在可容许的不变二次无偏估计类中,讨论了非负参数函数的非负估计问题,给出了可容许的非负定估计存在的充要条件。     

一种新的自变量选择准则

本文提出了一种着眼于提高回归系数估值精度的自变量选取准则,同时给出了相应的算法。